Symmetric Cardinality Constraint with Costs

نویسندگان

  • Waldemar Kocjan
  • Per Kreuger
  • Björn Lisper
چکیده

The symmetric cardinality constraint is described in terms of a set of variables X = {x1, . . . , xk}, which take their values as subsets of V = {v1, . . . , vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [lxi , uxi ] and at the same time it restricts the number of occurrences of each value vj ∈ V in the sets assigned to variables in X to be in an other interval [lvj , uvj ]. In this paper we extend the symmetric cardinality constraint with a function which associate with each value of each variable a cost and constraints the global cost of the constraint to the sum of costs associated with assigned values. We also give an algorithm for computing the consistency of a symmetric cardinality constraint with costs and describe filtering methods for this constraint.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maintaining Consistency of Dynamic Cardinality Constraints with Costs

This paper introduce a novel method for maintaining consistency of cardinality constraints in context of dynamic constraint satisfaction. The presented method adopt sensitivity analysis for feasible and minimum cost flows underlying all cardinality constraints. Moreover, we extend a dynamic all-pairs shortest path algorithm to support weight changes, insertion and deletion of multiple edges and...

متن کامل

Supplementary Material to “ Label Selection on Graphs ”

Krause et al. [2008] has an indirect proof that F ′ is not submodular. They give an example that shows the greedy algorithm can do arbitrarily bad when maximizing F ′ under a cardinality constraint. If F ′ were submodular the greedy algorithm would give a (1 − 1/e) approximation for maximizing under a cardinality constraint. We give a direct proof that F ′ is not submodular for completeness. In...

متن کامل

Arc Consistency for Global Cardinality Constraints with Costs

A global cardinality constraint (gcc) is speciied in terms of a set of variables X = fx1;:::;xpg which take their values in a subset of V = fv1;:::;vdg. It constrains the number of times each value vi 2 V is assigned to a variable in X to be in an interval li; ui]. A gcc with costs (costgcc) is a generalization of a gcc in which a cost is associated with each value of each variable. Then, each ...

متن کامل

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs

We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. We present a general algorithmic solution based on solving the problem variant without the cardinality constraint. We yield constant factor approximations depending on the s...

متن کامل

ModelSeeker: Extracting Global Constraint Models from Positive Examples

Sequence Generator Projection Constraint Conjunction 1 scheme(612,34,18,34,1) id alldifferent*18 2 scheme(612,34,18,2,2) id alldifferent*153 3 scheme(612,34,18,1,18) id alldifferent*34 4 scheme(612,34,18,1,18) absolute value symmetric alldifferent([1..18])*34 5 scheme(612,34,18,17,1) absolute value alldifferent*36 6 repart(612,34,18,34,9) id sum ctr(0)*306 7 repart(612,34,18,34,9) id twin*1 8 r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004